Computing 2-dimensional Min, Median and Max Filters
نویسنده
چکیده
Fast algorithms to compute min, median, max or any other order statistic lter transforms are described and lower bounds for their computation are shown. The algorithms take constant time per pixel to compute min or max lters and polylog time per pixel, in the size of the lter, to compute the median lter.
منابع مشابه
Optimal Algorithms for Running Max and Min Filters on Random Inputs
Given a $d$-dimensional array and an integer $p$, the max (or min) filter is the set of maximum (or minimum) elements within a $d$-dimensional sliding window of edge length $p$ inside the array. The current best algorithm for computing the 1D max (or min) filter, due to [Yuan, Atallah '11], uses $1+o(1)$ comparisons per sample in the worst case. As a direct consequence, the $d$-dimensional max ...
متن کاملMorphological filters-Part II: Their relations to median, order-statistic, and stack filters
This paper extends the theory of median, order-statistic (OS), and stack filters by using mathematical morphology to analyze them and by relating them to those morphological erosions, dilations, openings, closings, and open-closings that commute with thresh-olding. The max-min representation of OS filters is introduced by showing that any median or other OS filter is equal to a maximum of erosi...
متن کاملBiomedical Image Denoising Based on Hybrid Optimization Algorithm and Sequential Filters
Background: Nowadays, image de-noising plays a very important role in medical analysis applications and pre-processing step. Many filters were designed for image processing, assuming a specific noise distribution, so the images which are acquired by different medical imaging modalities must be out of the noise. Objectives: This study has focused on the sequence filters which are selected ...
متن کاملResource Efficient Hardware Architecture for Fast Computation of Running Max/Min Filters
Running max/min filters on rectangular kernels are widely used in many digital signal and image processing applications. Filtering with a k × k kernel requires of k(2) - 1 comparisons per sample for a direct implementation; thus, performance scales expensively with the kernel size k. Faster computations can be achieved by kernel decomposition and using constant time one-dimensional algorithms o...
متن کاملMammogram Enhancement Using Quadratic Adaptive Volterra Filter- a Comparative Analysis in Spatial and Frequency Domain
Early breast cancer in women can be detected efficiently, by processing Mammograms in an effective way. Mammographic images are affected by noise which has low contrast and poor radiographic resolution based on illperformance of X-ray hardware systems. This leads to improper visualization of lesion detail. Generally Non-linear filters are preferred for image enhancement applications. Because th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996